Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p
نویسندگان
چکیده
A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of order 8p are classified for each prime p. It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order 56, one infinite family exists for every prime p > 3 and the other family exists if and only if p ≡ 1 (mod 4). For each family there is a unique graph for a given order.
منابع مشابه
Normal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
متن کاملCubic Non-Cayley Vertex-Transitive Bi-Cayley Graphs over a Regular $p$-Group
A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic nonCayley vertex-transitive bi-Cayley graphs over a regular p-group, where p > 5 is a prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order 2p3 is given for each prime p.
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملNote on cubic symmetric graphs of order 2pn
Let p be a prime and n a positive integer. In [J. Austral. Math. Soc. 81 (2006), 153–164], Feng and Kwak showed that if p > 5 then every connected cubic symmetric graph of order 2p is a Cayley graph. Clearly, this is not true for p = 5 because the Petersen graph is non-Cayley. But they conjectured that this is true for p = 3. This conjecture is confirmed in this paper. Also, for the case when p...
متن کاملThe maximum genus of vertex-transitive graphs
Graphs possessing a high degree of symmetry have often been considered in topological graph theory. For instance, a number of constructions of genus embeddings by means of current or voltage graphs is based on the observation that a graph can be represented as a Cayley graph for some group. Another kind of embedding problems where symmetrical graphs are encountered is connected with regular map...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012